Axioms for Deferred Acceptance

نویسندگان

  • FUHITO KOJIMA
  • MIHAI MANEA
چکیده

The deferred acceptance algorithm is often used to allocate indivisible objects when monetary transfers are not allowed. We provide two characterizations of agent-proposing deferred acceptance allocation rules. Two new axioms, individually rational monotonicity and weak Maskin monotonicity, are essential to our analysis. An allocation rule is the agent-proposing deferred acceptance rule for some acceptant substitutable priority if and only if it satisfies non-wastefulness and individually rational monotonicity. An alternative characterization is in terms of non-wastefulness, population monotonicity and weak Maskin monotonicity. We also offer an axiomatization of the deferred acceptance rule generated by an exogenously specified priority structure. We apply our results to characterize efficient deferred acceptance rules.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Near-Optimality of The Reverse Deferred Acceptance Algorithm

This mathematics honors thesis provides an analysis of the optimality of the “Reverse Deferred Acceptance Algorithm” created by Paul Milgrom and Illya Segal for the Federal Communications Commission auction for spectrum licenses. We begin by first providing a general literature review of combinatorial auctions, including algorithmic attempts at solving such optimization problems. A description ...

متن کامل

Discounting of Letters of Credit; a Legal Analysis

Letter of Credit is an international payment instrument whereby the issuing bank undertakes to pay the beneficiary, against presentation of certain stipulated documents, according to the conditions of the Letter of Credit. Discounting of LC for the short-term financing of the seller, due to the independent and irrevocable undertaking of the bank to make payment, is prevalent. Beneficiary gets t...

متن کامل

An alternative characterization of the deferred acceptance algorithm

Kojima and Manea (2010) present two characterizations of when an allocation rule corresponds to the agent-proposing deferred acceptance algorithm for some substitutable priority rule of the objects being assigned. Building on their results we characterize when an allocation rule is outcome equivalent to the deferred acceptance algorithm for every substitutable priority rule. In particular, an a...

متن کامل

On the consistency of deferred acceptance when priorities are acceptant substitutable

In the context of resource allocation on the basis of responsive priorities, Ergin (2002) identifies a necessary and sufficient condition for the deferred acceptance rule to satisfy a consistency principle. In this note we extend this result to the domain of substitutable priorities, complementing results of Kojima and Manea (2010) and Kumano (2009). JEL classification: D63, C78.

متن کامل

Expanding “Choice” in School Choice

Truthful revelation of preferences has emerged as a desideratum in the design of school choice programs. Gale-Shapley’s deferred acceptance mechanism is strategy-proof for students but limits their ability to communicate their preference intensities. This results in ex-ante inefficiency when ties at school preferences are broken randomly. We propose a variant of deferred acceptance mechanism wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009